Ehrhart Polynomials and Successive Minima

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Successive Minima and Radii

In this note we present inequalities relating the successive minima of a o-symmetric convex body and the successive inner and outer radii of the body. These inequalities build a bridge between known inequalities involving only either the successive minima or the successive radii.

متن کامل

Characteristic and Ehrhart Polynomials

Let A be a subspace arrangement and let (A; t) be the characteristic polynomial of its intersection lattice L(A). We show that if the subspaces in A are taken from L(Bn), where Bn is the type B Weyl arrangement, then (A; t) counts a certain set of lattice points. This is the only known combinatorial interpretation of this polynomial in the subspace case. One can use this result to study the par...

متن کامل

Linear projections and successive minima

In arithmetic geometry, cohomology groups are not vector spaces as in classical algebraic geometry but rather euclidean lattices. As a consequence, to understand these groups we need to evaluate not only their rank, but also their successive minima, which are fundamental invariants in the geometry of numbers. The goal of this article is to perform this task for line bundles on projective curves...

متن کامل

Secant Varieties and Successive Minima

Let X be a semi-stable arithmetic surface over the spectrum S of the ring of integers in a number field K. We assume that the generic fiber XK is geometrically irreducible and has positive genus. Consider a line bundle L on X , which is non-negative on every vertical fiber and equipped with an admissible metric (in the sense of Arakelov [A]) of positive curvature. In [S] we have shown that any ...

متن کامل

Generalized Ehrhart Polynomials

Let P be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations P (n) = nP is a quasi-polynomial in n. We generalize this theorem by allowing the vertices of P (n) to be arbitrary rational functions in n. In this case we prove that the number of lattice points in P (n) is a quasi-polynomial for n sufficiently large. Our work w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematika

سال: 2005

ISSN: 0025-5793,2041-7942

DOI: 10.1112/s0025579300000292